Minimization of semilinear automata
نویسندگان
چکیده
We investigate finite deterministic automata in sets with non-homogeneous atoms: integers with successor. As there are uncount-ably many deterministic finite automata in this setting, we restrict our attention to automata with semilinear transition function. The main results is a minimization procedure for semilinear automata. The proof is subtle and refers to decidability of existential Presburger arithmetic with divisibility predicates. Interestingly, the minimization is not obtained by the standard partition refinement procedure, and we demonstrate that this procedure does not necessarily terminate for semilinear automata.
منابع مشابه
Existence and multiplicity of positive solutions for a class of semilinear elliptic system with nonlinear boundary conditions
This study concerns the existence and multiplicity of positive weak solutions for a class of semilinear elliptic systems with nonlinear boundary conditions. Our results is depending on the local minimization method on the Nehari manifold and some variational techniques. Also, by using Mountain Pass Lemma, we establish the existence of at least one solution with positive energy.
متن کاملSemilinearity and Context-Freeness of Languages Accepted by Valence Automata
Valence automata are a generalization of various models of automata with storage. Here, each edge carries, in addition to an input word, an element of a monoid. A computation is considered valid if multiplying the monoid elements on the visited edges yields the identity element. By choosing suitable monoids, a variety of automata models can be obtained as special valence automata. This work is ...
متن کاملConstrained Properties, Semilinear Systems, and Petri Nets
We investigate the veriication problem of two classes of innnite state systems w.r.t. nonregular properties (i.e., nondeenable by nite-state !-automata). The systems we consider are Petri nets as well as semilinear systems including push-down systems and PA processes. On the other hand, we consider properties ex-pressible in the logic CLTL which is an extension of the linear-time temporal logic...
متن کاملMonadic Quantifiers Recognized by Deterministic Pushdown Automata
I characterize the class of type 〈1〉 quantifiers (or, equivalently, type 〈1, 1〉 quantifiers satisfying Conservativity and Extension) that are recognized by deterministic pushdown automata in terms of the associated semilinear sets of vectors in N. These semilinear sets are finite unions of linear sets with at most two generators each, which are taken from a common three-element set of the form ...
متن کاملConstraint Satisfaction and Semilinear Expansions of Addition over the Rationals and the Reals
A semilinear relation is a finite union of finite intersections of open and closed half-spaces over, for instance, the reals, the rationals, or the integers. Semilinear relations have been studied in connection with algebraic geometry, automata theory, and spatiotemporal reasoning. We consider semilinear relations over the rationals and the reals. Under this assumption, the computational comple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1210.4980 شماره
صفحات -
تاریخ انتشار 2012